A Abstraction in Fixpoint Logic
نویسندگان
چکیده
ion in Fixpoint Logic SJOERD CRANEN, MACIEJ GAZDA, WIEGER WESSELINK and TIM A.C. WILLEMSE, Eindhoven University of Technology We present a theory of abstraction for the framework of parameterised Boolean equation systems, a firstorder fixpoint logic. Parameterised Boolean equation systems can be used to solve a variety of problems in verification. We study the capabilities of the abstraction theory by comparing it to an abstraction theory for generalised Kripke modal transition systems (GTSs). We show that for model checking the modal μ-calculus, our abstractions can be exponentially more succinct than GTSs and our theory is as complete as the GTS framework for abstraction. Furthermore, we investigate the completeness of our theory irrespective of the encoded decision problem. We illustrate the potential of our theory through case studies using the first-order modal μ-calculus and a real-time extension thereof, conducted using a prototype implementation of a new syntactic transformation for parameterised Boolean equation systems.
منابع مشابه
Combining Predicate Abstraction with Fixpoint Approximations
In this paper we consider combining two techniques that have been effective in analyzing infinite-state systems: predicate abstraction and fixpoint approximations. Using a carefully crafted model of Airport Ground Network Control, we show that when predicate abstraction in a CEGAR loop fails to verify temporal logic properties of an infinite-state transition system, a combination of predicate a...
متن کاملAn effective fixpoint semantics for linear logic programs
In this paper we investigate the theoretical foundation of a new bottom-up semantics for linear logic programs, and more precisely for the fragment of LinLog (Andreoli, 1992) that consists of the language LO (Andreoli & Pareschi, 1991) enriched with the constant 1. We use constraints to symbolically and finitely represent possibly infinite collections of provable goals. We define a fixpoint sem...
متن کاملIncremental Computation of Success Patterns of Logic Programs
ions, that the set of success patterns of a logic program P with respect to an abstraction α is tantamount to the success set of the equational logic program where Eα is an equality theory induced by α. Therefore, either the fixpoint semantics or the procedural semantics defined for equational logic programs can be used to compute success patterns of logic programs. From this observation, the s...
متن کاملBinary Lambda Calculus and Combinatory Logic
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-interpreters for these binary languages. Along the way we also present new results on list representations, bracket abstraction, and fixpoint combinators. In the second part we review Algorithmic Information Theory, for whi...
متن کاملFixpoint Logic vs. Infinitary Logic in Finite-Model Theory
In recent years several extensions of first-order logic have been investigated in the context of finite-model theory. Fixpoint logic and the infinitary logic L∞ω with a finite number of variables have turned out to be of particular importance. The study of fixpoint logic generated interactions with both database theory and complexity theory, while the infinitary logic L∞ω proved to be a useful ...
متن کامل